Research on Composite SaaS Placement Problem Based on Ant Colony Optimization Algorithm with Performance Matching Degree Strategy

نویسندگان

  • Zhenzhang Liu
  • Zhihui Hu
  • Lee K. Jonepun
چکیده

Cloud computing is a term referring to the latest new computing paradigm based on the Internet where a program or application runs on a connected server or servers rather than on a local computing device. Software as a Service (SaaS) is one of the most important computing services in cloud computing. The advantages of SaaS products are well recognized including lower cost of entry, minimal demands on IT and easy upgrades as well as more rigorous. However, this approach has introduced new challenges in SaaS resource management in data centres. One of the challenges is deploying softwares comprised of service and data components over servers in cloud to provide users with required services easily and quickly in SaaS cloud computing. This paper analyzes the SaaS Placement Problem (SPP) and proposes a mathematical model for Composite SaaS placement in cloud. An Ant Colony Optimization Algorithm (ACOA) with performance matching degree Strategy is applied to the problem with the aim of minimizing the total estimated execution time of all the SaaS components and reducing the algorithm computation time. The ACOA is then evaluated against the Genetic Algorithm in experiments and the results show that the ACOA applied to the SPP not only has quicker computation time but also generates better solutions than the Genetic Algorithm (GA). Subject Categories and Descriptors F.2.1 [Analysis of Algorithm and Problem Complexity]: Numerical Algorithm and Problems H.3.5 [Information Storage and Retrieval]: Online Information Services General Terms: Cloud Computing, Ant Colony Optimization Algorithm

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

New Ant Colony Algorithm Method based on Mutation for FPGA Placement Problem

Many real world problems can be modelled as an optimization problem. Evolutionary algorithms are used to solve these problems. Ant colony algorithm is a class of evolutionary algorithms that have been inspired of some specific ants looking for food in the nature. These ants leave trail pheromone on the ground to mark good ways that can be followed by other members of the group. Ant colony optim...

متن کامل

Ant colony algorithm as a high-performance method in resource estimation using LVA field; A case study: Choghart Iron ore deposit

Kriging is an advanced geostatistical procedure that generates an estimated surface or 3D model from a scattered set of points. This method can be used for estimating resources using a grid of sampled boreholes. However, conventional ordinary kriging (OK) is unable to take locally varying anisotropy (LVA) into account. A numerical approach has been presented that generates an LVA field by calcu...

متن کامل

Optimal Placement and Sizing of DGs and Shunt Capacitor Banks Simultaneously in Distribution Networks using Particle Swarm Optimization Algorithm Based on Adaptive Learning Strategy

Abstract: Optimization of DG and capacitors is a nonlinear objective optimization problem with equal and unequal constraints, and the efficiency of meta-heuristic methods for solving optimization problems has been proven to any degree of complex it. As the population grows and then electricity consumption increases, the need for generation increases, which further reduces voltage, increases los...

متن کامل

PMU Placement Methods in Power Systems based on Evolutionary Algorithms and GPS Receiver

In this paper, optimal placement of Phasor Measurement Unit (PMU) using Global Positioning System (GPS) is discussed. Ant Colony Optimization (ACO), Simulated Annealing (SA), Particle Swarm Optimization (PSO) and Genetic Algorithm (GA) are used for this problem. Pheromone evaporation coefficient and the probability of moving from state x to state y by ant are introduced into the ACO. The modifi...

متن کامل

FORCED WATER MAIN DESIGN MIXED ANT COLONY OPTIMIZATION

Most real world engineering design problems, such as cross-country water mains, include combinations of continuous, discrete, and binary value decision variables. Very often, the binary decision variables associate with the presence and/or absence of some nominated alternatives or project’s components. This study extends an existing continuous Ant Colony Optimization (ACO) algorithm to simultan...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • JDIM

دوره 12  شماره 

صفحات  -

تاریخ انتشار 2014